Trading help for interaction in statistical zero-knowledge proofsBEN-OR, Michael; GUTFREUND, Dan.Journal of cryptology. 2003, Vol 16, Num 2, pp 95-116, issn 0933-2790, 22 p.Article

Automorphism groups of graphs and edge-contractionBABAI, Laszlo.Discrete mathematics. 2006, Vol 306, Num 10-11, pp 918-922, issn 0012-365X, 5 p.Article

A note on cyclic-cubesHWANG, S.-C; CHEN, G.-H.Information processing letters. 1999, Vol 72, Num 3-4, pp 131-135, issn 0020-0190Article

SUBCOMPLETE GENERALIZATIONS OF GRAPH ISOMORPHISMHOFFMANN CM.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 3; PP. 332-359; BIBL. 31 REF.Article

On the hardness of graph isomorphismTORAN, Jacobo.SIAM journal on computing (Print). 2004, Vol 33, Num 5, pp 1093-1108, issn 0097-5397, 16 p.Article

RECENT DIRECTIONS IN ALGORITHMIC RESEARCHHOPCROFT J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 123-134; BIBL. 2 P.Conference Paper

Complexity results in graph reconstructionHEMASPAANDRA, Edith; HEMASPAANDRA, Lane A; RADZISZOWSKI, Stanislaw P et al.Discrete applied mathematics. 2007, Vol 155, Num 2, pp 103-118, issn 0166-218X, 16 p.Conference Paper

Isomorphism between Cayley (di)graphsFEMANDES, J. G; GIUDICI, R. E.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 361-364, issn 0012-365X, 4 p.Article

A quasicancellation property for the direct product of graphsHAMMACK, Richard H.Discrete mathematics. 2010, Vol 310, Num 12, pp 1691-1696, issn 0012-365X, 6 p.Article

TESTING GRAPH ISOMORPHISMFISCHER, Eldar; MATSLIAH, Arie.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 207-225, issn 0097-5397, 19 p.Article

The difficulty of testing for isomorphism against a graph that is given in advanceFISCHER, Eldar.SIAM journal on computing (Print). 2005, Vol 34, Num 5, pp 1147-1158, issn 0097-5397, 12 p.Article

A selected tour of the theory of identification matricesLIN CHEN.Theoretical computer science. 2000, Vol 240, Num 2, pp 299-318, issn 0304-3975Article

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most twoESCHEN, Elaine M; HOANG, Chính T; SRITHARAN, R et al.Discrete mathematics. 2011, Vol 311, Num 6, pp 431-434, issn 0012-365X, 4 p.Article

Equivariant collapses and the homotopy type of iterated clique graphsLARRION, F; PIZANA, M. A; VILLARROEL-FLORES, R et al.Discrete mathematics. 2008, Vol 308, Num 15, pp 3199-3207, issn 0012-365X, 9 p.Article

Uniquely pairable graphsZHONGYUAN CHE.Discrete mathematics. 2008, Vol 308, Num 24, pp 6104-6110, issn 0012-365X, 7 p.Article

Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphsJIN HO KWAK; YOUNG SOO KWON.Discrete mathematics. 2008, Vol 308, Num 11, pp 2156-2166, issn 0012-365X, 11 p.Article

THE SYMMETRIC GROUP DEFIES STRONG FOURIER SAMPLINGMOORE, Cristopher; RUSSELL, Alexander; SCHULMAN, Leonard J et al.SIAM journal on computing (Print). 2008, Vol 37, Num 6, pp 1842-1864, issn 0097-5397, 23 p.Article

Graph isomorphism is in SPPARVIND, V; KURUR, Piyush P.Information and computation (Print). 2006, Vol 204, Num 5, pp 835-852, issn 0890-5401, 18 p.Article

The complexity of Boolean matrix root computationKUTZ, Martin.Theoretical computer science. 2004, Vol 325, Num 3, pp 373-390, issn 0304-3975, 18 p.Conference Paper

On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphismCHAI WAH WU.Discrete mathematics. 2010, Vol 310, Num 21, pp 2811-2814, issn 0012-365X, 4 p.Article

More on almost self-complementary graphsFRANCETIC, Nevena; SAJNA, Mateja.Discrete mathematics. 2009, Vol 309, Num 10, pp 3106-3112, issn 0012-365X, 7 p.Article

On the parameterized complexity of d-dimensional point set pattern matchingCABELLO, Sergio; GIANNOPOULOS, Panos; KNAUER, Christian et al.Information processing letters. 2008, Vol 105, Num 2, pp 73-77, issn 0020-0190, 5 p.Article

Complexity classes of equivalence problems revisitedFORTNOW, Lance; GROCHOW, Joshua A.Information and computation (Print). 2011, Vol 209, Num 4, pp 748-763, issn 0890-5401, 16 p.Article

The complexity of game isomorphismGABARRO, Joaquim; GARCIA, Alina; SERNA, Maria et al.Theoretical computer science. 2011, Vol 412, Num 48, pp 6675-6695, issn 0304-3975, 21 p.Article

The first order definability of graphs : Upper bounds for quantifier depthPIKHURKO, Oleg; VEITH, Helmut; VERBITSKY, Oleg et al.Discrete applied mathematics. 2006, Vol 154, Num 17, pp 2511-2529, issn 0166-218X, 19 p.Article